A multi-scale algorithm for drawing graphs nicely

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Multi-Dimensional Algorithm for Drawing Large Graphs

We present a novel hierarchical force-directed method for drawing large graphs. The algorithm produces a graph embedding in an Euclidean space E of any dimension. A two or three dimensional drawing of the graph is then obtained by projecting a higher-dimensional embedding into a two or three dimensional subspace of E. Projecting high-dimensional drawings onto two or three dimensions often resul...

متن کامل

Drawing Trees Nicely with TeX

SUMMARY We present a new solution to the tree drawing problem that integrates an excellent tree drawing algorithm into one of the best text processing systems available. More precisely, we present a T E X macro package called TreeT E X that produces drawings of trees from a purely logical description. Our approach has three advantages: labels for nodes can be handled in a reasonable way; portin...

متن کامل

VLGD, Algorithm for Drawing Very Large Graphs

Given a large planar graph we want to display it in a meaningful fashion. We present VLGD: a new, straightforward and fast algorithm for automatic display of very large planar graphs. We recursively divide the graph in pieces of roughly equal size. As a result we get a collection of O(logn) layers, where n is the number of vertices in the graph. Each succeeding layer represents the graph in an ...

متن کامل

An Algorithm for Drawing General Undirected Graphs

Graphs (networks) are very common data structures which are handled in computers. Diagrams are widely used to represent the graph structures visually in many information systems. In order to automatically draw the diagrams which are, for example, state graphs, data-flow graphs, Petri nets, and entity-relationship diagrams, basic graph drawing algorithms are required. The state of the art in aut...

متن کامل

Drawing Trees Nicely with T E X 1

Various algorithms have been proposed for the diicult problem of producing aesthetically pleasing drawings of trees, see 14, 16] but implementations only exist as \special purpose software", designed for special environments. Therefore, many users resort to the drawing facilities available on most personal computers, but the gures obtained in this way still look \hand-drawn"; their quality is i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2001

ISSN: 0166-218X

DOI: 10.1016/s0166-218x(00)00389-9